Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
نویسندگان
چکیده
منابع مشابه
A faster fully polynomial approximation scheme for the single-machine total tardiness problem
Lawler [E.L. Lawler, A fully polynomial approximation scheme for the total tardiness problem, Operations Research Letters 1 (1982) 207–208] proposed a fully polynomial approximation scheme for the single-machine total tardiness problem which runs in O n 7 e time (where n is the number of jobs and e is the desired level of approximation). A faster fully polynomial approximation scheme running in...
متن کاملA Randomized Fully Polynomial-time Approximation Scheme for Weighted Perfect Matching in the Plane
In the approximate Euclidean min-weighted perfect matching problem, a set V of n 2 points in the plane and a real number 0 are given. Usually, a solution of this problem is a partition of points of V into n pairs such that the sum of the distances between the paired points is at most ) 1 ( times the optimal solution. In this paper, the authors give a randomized algorithm which follows a...
متن کاملSingle Machine and Parallel Machine Scheduling Problems with a Common Due Date to Minimize Total Weighted Tardiness
This paper deals with a common due date parallel machines scheduling problem in which each job has a different tardiness penalty. The objective is to minimize the total weighted tardiness. The scheduling problem of minimizing the total weighted tardiness with a common due date on a single machine is known to be ordinary NP-hard. This is also the case for problem Pm|di = d| ∑ wiTi. A new dynamic...
متن کاملA Fully Polynomial Time Approximation Scheme for Packing While Traveling
Understanding the interactions between different combinatorial optimisation problems in real-world applications is a challenging task. Recently, the traveling thief problem (TTP), as a combination of the classical traveling salesperson problem and the knapsack problem, has been introduced to study these interactions in a systematic way. We investigate the underlying non-linear packing while tra...
متن کاملAn Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering
In the bin covering problem there is a group L=(a1; : : : ; an) of items with sizes s̃(ai)∈ (0; 1), and the goal is to 6nd a packing of the items into bins to maximize the number of bins that receive items of total size at least 1. This is a dual problem to the classical bin packing problem. In this paper we present the 6rst asymptotic fully polynomial-time approximation scheme for the problem. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2010
ISSN: 0166-218X
DOI: 10.1016/j.dam.2010.01.013